Π1 Classes, Peano Arithmetic, Randomness, and Computable Domination
نویسندگان
چکیده
2 Open and Closed Classes in Cantor Space 5 2.1 Open Classes . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Closed Classes . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 The Compactness Theorem . . . . . . . . . . . . . . . . . . . 7 2.4 Notation For Trees . . . . . . . . . . . . . . . . . . . . . . . . 7 2.5 Effective Compactness Theorem . . . . . . . . . . . . . . . . . 8
منابع مشابه
Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination
We present an overview of the topics in the title and of some of the key results pertaining to them. These have historically been topics of interest in computability theory and continue to be a rich source of problems and ideas. In particular, we draw attention to the links and connections between these topics and explore their significance to modern research in the field.
متن کاملOn the Structure of the Degrees of Relative Provability
We investigate the structure of the degrees of provability, which measure the proof-theoretic strength of statements asserting the totality of given computable functions. The degrees of provability can also be seen as an extension of the investigation of relative consistency statements for firstorder arithmetic (which can be viewed as Π1-statements, whereas statements of totality of computable ...
متن کاملRandomness via effective descriptive set theory
1.1 Informal introduction to Π1 relations Let 2N denote Cantor space. • A relation B ⊆ N × (2N)r is Π1 if it is obtained from an arithmetical relation by a universal quantification over sets. • If k = 1, r = 0 we have a Π1 set ⊆ N. • If k = 0, r = 1 we have a Π1 class ⊆ 2N. • The relation B is∆1 if both B and its complement are Π1. There is an equivalent representation of Π1 relations where the...
متن کاملΠ1 classes and orderable groups
It is known that the spaces of orders on orderable computable fields can represent all Π1 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent Π1 classes in even a weak manner. Next, we consider presentations of ordered abelian groups, and we show that there is a computable ordered abelian group for which no computa...
متن کاملLogic Blog
1. Jan 2010: a downward GL1 set that is not weakly jump traceable 2 1.1. Original result 2 1.2. New results 2 1.3. Comments 2 2. March 2010: Structures that are computable almost surely 2 2.1. A structure that is computable almost surely, is computable in every Π1 random 2 2.2. Related questions 3 3. May 2010 : Cooper’s jump inversion and weak jump traceability 3 4. May 2010: The collection of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009